Symmetric designs possessing tactical decompositions
نویسندگان
چکیده
منابع مشابه
Tactical decompositions of designs over finite fields
Abstract. An automorphism group of an incidence structure I induces a tactical decomposition on I. It is well known that tactical decompositions of t-designs satisfy certain necessary conditions which can be expressed as equations in terms of the coefficients of tactical decomposition matrices. In this article we present results obtained for tactical decompositions of q-analogs of t-designs, mo...
متن کاملOn Strong Tactical Decompositions
If a 2-(v, k, k) design 2) admits a tactical decomposition with d point classes and c block classes then b — v ^ c—d ^ 0, (see [3]). Decompositions for which b+d = v + c are of special interest (see for instance [1]), and are called strong. Any tactical decomposition of a symmetric design is strong. A strong tactical decomposition of a design is called a strong resolution if it has only one poi...
متن کاملPartial differential equations possessing Frobenius integrable decompositions
Frobenius integrable decompositions are introduced for partial differential equations. A procedure is provided for determining a class of partial differential equations of polynomial type, which possess specified Frobenius integrable decompositions. Two concrete examples with logarithmic derivative Bäcklund transformations are given, and the presented partial differential equations are transfor...
متن کاملSymmetric-Acyclic Decompositions of Networks
This paper presents two new developments for partitioning networks. One is the symmetric-acyclic decomposition of a network and the other is a generalized blockmodeling approach to establish such decompositions of networks. Both are founded in the Davis and Leinhardt (1972) formulation of a ranked clusters model as a theoretical expectation concerning the structure of human groups and affect di...
متن کاملSum Decompositions of Symmetric Matrices
Given a symmetric n X n matrix A and n numbers rl," " rn , necessary and sufficient conditions for the existence of a matrix B, with a given zero pattern, with row sums r 1 , ... , rn , and such that A = B + BT are proven. If the pattern restriction * The research of all three authors was supported by the Funda~ao Calouste Gulbenkian, Lisboa. tThe research of this author was carried out within ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2011
ISSN: 1930-5346
DOI: 10.3934/amc.2011.5.199